Towards Transparent Parallelization of Connectionist Systems

نویسندگان

  • G. Kock
  • M. Endler
  • M. D. Gubitoso
  • S. W. Song
چکیده

This paper deals with the transparent paralleliza-tion of neural networks. The goal is to automatically derive parallel code for MIMD and SPMD architec-tures from abstract descriptions of networks. In this, unit parallelism and training set parallelism are discussed. First, an outline of the abstract neural network description language CONNECT is given. The language combines procedural, functional, and object{ oriented paradigms and allows for readable and complete deenitions of connectionist systems. Currently, C++ code can be generated from CONNECT specii-cations. The code generation process is explained, and it is shown how unit parallelism can be realized just by modifying this process. At the end, an extension of the CONNECT language is proposed which allows for transparent training set parallelization.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards Transparent Parallelization of Connectionist Systems

Much work has been done in the area of parallel simulation of connectionist systems. However, usually parallel implementation issues for artiicial neural networks have been discussed in general terms, but the actual parallel programs implement speciic network models and are written in programming languages like C or C++. This paper deals with the transparent parallelization of neural networks. ...

متن کامل

Generating Parallel Code from High{level Neural Network Descriptions

Much work has been done in the area of parallel simulation of connectionist systems. However, usually parallel implementation issues for arti cial neural networks have been discussed in general terms, but the actual parallel programs implement speci c network models and are written in programming languages like C or C++. This paper deals with the transparent parallelization of neural networks. ...

متن کامل

Parallelization of Connectionist Models Based on a Symbolic Formalism

In this paper we study the parallelization of the inference process for connectionist models. We use a symbolic formalism for the representation of the connectionist models. With this translation, the training mechanism is local in the elements of the network, the computing power is improved in the network nodes and a local hybridization with symbolic parts is achieved. The inference in the nal...

متن کامل

Parallelization Techniques for Semantic Web Reasoning Applications

Performance is the most critical aspect towards achieving high scalability of Semantic Web reasoning applications, and considerably limits the application areas of them. There is still a deep mismatch between the requirements for reasoning on a Web scale and performance of the existing reasoning engines. The performance limitation can be considerably reduced by utilizing such large-scale e-Infr...

متن کامل

CHCL - A Connectionist Infernce System

Chcl is a connectionist inference system for H orn logic which is based on the connection method and uses limited resources. This paper gives an overview of the system and its implementation.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996